58 research outputs found
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks
We introduce an opportunistic interference mitigation (OIM) protocol, where a
user scheduling strategy is utilized in -cell uplink networks with
time-invariant channel coefficients and base stations (BSs) having
antennas. Each BS opportunistically selects a set of users who generate the
minimum interference to the other BSs. Two OIM protocols are shown according to
the number of simultaneously transmitting users per cell: opportunistic
interference nulling (OIN) and opportunistic interference alignment (OIA).
Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As
our main result, it is shown that DoFs are achievable under the OIN
protocol with selected users per cell, if the total number of users in
a cell scales at least as . Similarly, it turns out that
the OIA scheme with () selected users achieves DoFs, if scales
faster than . These results indicate that there exists a
trade-off between the achievable DoFs and the minimum required . By deriving
the corresponding upper bound on the DoFs, it is shown that the OIN scheme is
DoF optimal. Finally, numerical evaluation, a two-step scheduling method, and
the extension to multi-carrier scenarios are shown.Comment: 18 pages, 3 figures, Submitted to IEEE Transactions on Communication
Recommended from our members
Efficient non-convex algorithms for large-scale learning problems
The emergence of modern large-scale datasets has led to a huge interest in the problem of learning hidden complex structures. Not only can models from such structures fit the datasets, they also have good generalization performance in the regime where the number of samples are limited compared to the dimensionality. However, one of the main issues is finding computationally efficient algorithms to learn the models. While convex relaxation provides polynomial-time algorithms with strong theoretical guarantees, there are demands for even faster algorithms with competitive performances, due to the large volume of the practical datasets. In this dissertation, we consider three types of algorithms, greedy methods, alternating minimization, and non-convex gradient descent, that have been key non-convex approaches to tackle the large-scale learning problems. For each theme, we focus on a specific problem and design an algorithm based on the designing ideas. We begin with the problem of subspace clustering, where one needs to learn underlying unions of subspaces from a set of data points around the subspaces. We develop two greedy algorithms that can perfectly cluster the points and recover the subspaces. The next problem of interest is collaborative ranking, where underlying low-rank preference matrices are to be learned from pairwise comparisons of the entries. We present an alternating minimization based algorithm. Finally, we develop a non-convex gradient descent algorithm for general low-rank matrix optimization problems. All of these algorithms exhibit low computational complexities as well as competitive statistical performances, which make them scalable and suitable for a variety of practical applications of the problems. Analysis of the algorithms provides theoretical guarantees of their performances.Electrical and Computer Engineerin
Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks?
We introduce a distributed opportunistic scheduling (DOS) strategy, based on
two pre-determined thresholds, for uplink -cell networks with time-invariant
channel coefficients. Each base station (BS) opportunistically selects a mobile
station (MS) who has a large signal strength of the desired channel link among
a set of MSs generating a sufficiently small interference to other BSs. Then,
performance on the achievable throughput scaling law is analyzed. As our main
result, it is shown that the achievable sum-rate scales as
in a high signal-to-noise ratio (SNR) regime, if the
total number of users in a cell, , scales faster than
for a constant . This
result indicates that the proposed scheme achieves the multiuser diversity gain
as well as the degrees-of-freedom gain even under multi-cell environments.
Simulation results show that the DOS provides a better sum-rate throughput over
conventional schemes.Comment: 11 pages, 3 figures, 2 tables, to appear in IEEE Transactions on
Communication
Learning Disentangled Representation for Fair Facial Attribute Classification via Fairness-aware Information Alignment
Although AI systems archive a great success in various societal fields, there still exists a challengeable issue of outputting discriminatory results with respect to protected attributes (e.g., gender and age). The popular approach to solving the issue is to remove protected attribute information in the decision process. However, this approach has a limitation that beneficial information for target tasks may also be eliminated. To overcome the limitation, we propose Fairness-aware Disentangling Variational Auto-Encoder (FD-VAE) that disentangles data representation into three subspaces: 1) Target Attribute Latent (TAL), 2) Protected Attribute Latent (PAL), 3) Mutual Attribute Latent (MAL). On top of that, we propose a decorrelation loss that aligns the overall information into each subspace, instead of removing the protected attribute information. After learning the representation, we re-encode MAL to include only target information and combine it with TAL to perform downstream tasks. In our experiments on CelebA and UTK Face datasets, we show that the proposed method mitigates unfairness in facial attribute classification tasks with respect to gender and age. Ours outperforms previous methods by large margins on two standard fairness metrics, equal opportunity and equalized odds
- …